An Efficient Algorithm for Upper Bound on the Partition Function of Nucleic Acids
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Upper Bound on the Partition Function of Nucleic Acids
It has been shown that minimum free-energy structure for RNAs and RNA-RNA interaction is often incorrect due to inaccuracies in the energy parameters and inherent limitations of the energy model. In contrast, ensemble-based quantities such as melting temperature and equilibrium concentrations can be more reliably predicted. Even structure prediction by sampling from the ensemble and clustering ...
متن کاملnano-rods zno as an efficient catalyst for the synthesis of chromene phosphonates, direct amidation and formylation of amines
چکیده ندارد.
An Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملA partition function algorithm for interacting nucleic acid strands
UNLABELLED Recent interests, such as RNA interference and antisense RNA regulation, strongly motivate the problem of predicting whether two nucleic acid strands interact. MOTIVATION Regulatory non-coding RNAs (ncRNAs) such as microRNAs play an important role in gene regulation. Studies on both prokaryotic and eukaryotic cells show that such ncRNAs usually bind to their target mRNA to regulate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2013
ISSN: 1066-5277,1557-8666
DOI: 10.1089/cmb.2013.0003